Comparisons of Parikh’s Condition
نویسندگان
چکیده
In this paper we first compare Parikh’s condition to various pumping conditions Bar-Hillel’s pumping lemma, Ogden’s condition and Bader-Moura’s condition; secondly, to interchange condition; and finally, to Sokolowski’s and Grant’s conditions. In order to carry out these comparisons we present some properties of Parikh’s languages. The main result is the orthogonality of the previously mentioned conditions and Parikh’s condition.
منابع مشابه
Comparisons of Parikh's Condition to Other Conditions for Context-free Languages
In this paper we first compare Parikh’s condition to various pumping conditions ~ BarHillel’s pumping lemma, Ogden’s condition and Bader-Moura’s condition; secondly, to interchange condition; and finally, to Sokolowski’s and Grant“s conditions. In order to carry out these comparisons we present some properties of Parikh’s languages. The main result is the orthogonality of the previously mention...
متن کاملParikh’s theorem
This chapter will discuss Parikh’s theorem and provide a proof for it. The proof is done by induction over a set of derivation trees, and using the Parikh mappings obtained from the set of terminal derivation trees and the possible enlargement of them during derivation. Moreover, the usefulness of the theorem will be lightly addressed.
متن کاملLanguage Splitting and Relevance-Based Belief Change in Horn Logic
This paper presents a framework for relevance-based belief change in propositional Horn logic. We firstly establish a parallel interpolation theorem for Horn logic and show that Parikh’s Finest Splitting Theorem holds with Horn formulae. By reformulating Parikh’s relevance criterion in the setting of Horn belief change, we construct a relevance-based partial meet Horn contraction operator and p...
متن کاملBounded Arithmetic, Proof Complexity and Two Papers of Parikh
This article surveys R. Parikh’s work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh’s papers on these subjects and some of the subsequent progress in the areas of feasible arithmetic and lengths of proofs.
متن کاملDistance Semantics for Relevance-Sensitive Belief Revision
Possible-world semantics are provided for Parikh’s relevance-sensitive model for belief revision. Having Grove’s system-of-spheres construction as a base, we consider additional constraints on measuring distance between possible worlds, and we prove that, in the presence of the AGM postulates, these constraints characterize precisely Parikh’s axiom (P). These additional constraints essentially ...
متن کامل